A New Case for Skewed - Associativity André Seznec

A New Case for Skewed-Associativity

Skewed-associative caches have been shown to statisticaly exhibit lower miss ratios than set-associative caches at equal associativity degrees. But for L1 caches, the performance of a four-way set-associative cache is known to be quite close to that of a 16-way set-associative cache. In this paper, we rst show that BTBs and L2 caches featuring long line size may beneet a lot from a high associa...

About Cache Associativity in Low-Cost Shared Memory Multi-Microprocessors

Architecturesparalì eles, bases de données, réseaux et systèmes distribués About cache associativity in low-cost shared memory multi-microprocessors Abstract: In 1993, sizes of on-chip caches on current commercial microprocessors range from 16K bytes to 36 Kbytes. These microprocessors can be directly used in the design of a low cost single-bus shared memory multiprocessors without using any se...

Skewed Associativity Improves Program Performance and Enhances Predictability

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for crating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. 1 Abstract Performance tuning becomes harder as computer technology advanc...

A statistical model of skewed-associativity

This paper presents a statistical model for explaining why skewed-associativity removes conflicts better than setassociativity. We show that, with a high probability, 2-way skewed associativity emulates full associativity for workingsets up to half the cache size, and we show that 3-way skewed-associativity is almost equivalent to full associativity.

A case for (partially) TAgged GEometric history length branch prediction